Analyses of error correction strategies for typical communication channels in watermarking

نویسندگان

  • Séverine Baudry
  • Jean-François Delaigle
  • Bülent Sankur
  • Benoit M. Macq
  • Henri Maître
چکیده

Most watermarking techniques rely on redundancy where signature bits are encoded in a su$ciently large amount of sites for robustness against distortions and attacks while the watermark energy is kept low enough to remain imperceptible. The goal of this paper is to explore some strategies for exploiting this redundancy using error correcting codes. In some watermarking techniques bits are extracted via hard-decisions leading to a binary symmetric channel model while in others the extraction is carried out with soft-decisions leading to a additive Gaussian channel model. First, we consider error correcting codes for very high error rates of the watermarking channel where the trade-o!s of Bose}Chaudury}Hocquenheim (BCH) and repetition codes are investigated. We also present the performance and a fast implementation of soft-decoders. We give two potential realizations of soft-decoding, namely, Viterbi decoder for convolutional codes and a new algorithm for soft-BCH decoding. 2001 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introduction and Estimation of Monetary Conditions Index for Iran's Economy Using Johansson-Josilius Error Correction Method

Determining the monetary policy rule and identifying expansionary and contractionary policies is of particular importance to monetary policymakers. Monetary conditions index as an average weight of effective money transfer channels can play an important role in identifying expansionary and contractionary monetary policies. Therefore, in this article, the index of monetary conditions along with ...

متن کامل

A Runlength Coded Ldpc Scheme for Insertion/deletion Correction in Multimedia Watermarking

We describe a simple and effective coding scheme for insertion/deletion channels. It is based on runlength coding which converts a class of insertion/deletion channels that have infinite memory into memoryless channels, which are much easier to handle. Runlength coding is then combined with powerful error correction low-density parity-check (LDPC) codes designed for memoryless channels. We cons...

متن کامل

Nested Codes for Constrained Memory and for Dirty Paper

Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to some classes of constrained memories, and we explore the binary so-called nested codes, which are used for e cient coding and error-correction on such channels and memories.

متن کامل

Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver

Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...

متن کامل

Spatial image watermarking using spread spectrum modulation

The paper presents low cost spatial image watermarking scheme where inherent anti jamming and interference rejection property of spread spectrum modulation is utilized to provide robustness against image distortions and malicious attempts to remove or tamper with the watermark. The use of error correction code allows a trade-off between degree of robustness and embedding rate for a given attack...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Signal Processing

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2001